Optimum quantum error recovery using semidefinite programming
نویسندگان
چکیده
منابع مشابه
Optimum quantum error recovery using semidefinite programming
Andrew S. Fletcher,* Peter W. Shor, and Moe Z. Win Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Lincoln Laboratory, Massachusetts Institute of Technology, Lexington, Massachusetts 02420 Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Received 7 June 2006; publishe...
متن کاملPhase recovery, MaxCut and complex semidefinite programming
Phase retrieval seeks to recover a signal x ∈ C from the amplitude |Ax| of linear measurements Ax ∈ C. We cast the phase retrieval problem as a non-convex quadratic program over a complex phase vector and formulate a tractable relaxation (called PhaseCut) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm wh...
متن کاملDesigning optimal quantum detectors via semidefinite programming
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing between a collection of quantum states, represented by a set of density operators. We show that the design of the optimal detector can be formulated as a semidefinite programming problem. Based on this formulation, we derive a set of necessary and sufficient cond...
متن کاملFinite quantum tomography via semidefinite programming
Using the the convex semidefinite programming method and superoperator formalism we obtain the finite quantum tomography of some mixed quantum states such as: qudit tomography, N-qubit tomography, phase tomography and coherent spin state tomography, where that obtained results are in agreement with those of References [21, 24, 25, 4, 26].
متن کاملEnsemble Clustering using Semidefinite Programming
We consider the ensemble clustering problem where the task is to 'aggregate' multiple clustering solutions into a single consolidated clustering that maximizes the shared information among given clustering solutions. We obtain several new results for this problem. First, we note that the notion of agreement under such circumstances can be better captured using an agreement measure based on a 2D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2007
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.75.012338